-
1 decomposition algorithm
Англо-русский словарь нормативно-технической терминологии > decomposition algorithm
-
2 decomposition algorithm
English-Russian big polytechnic dictionary > decomposition algorithm
-
3 decomposition algorithm
Англо-русский словарь нефтегазовой промышленности > decomposition algorithm
-
4 decomposition algorithm
1) Экономика: алгоритм декомпозиции, алгоритм разложения, блочный алгоритм2) Механика: алгоритм разбиения3) Робототехника: алгоритм разбиения (напр. изображений), алгоритм разбора (предложения)Универсальный англо-русский словарь > decomposition algorithm
-
5 decomposition algorithm
Англо-русский словарь по машиностроению > decomposition algorithm
-
6 decomposition algorithm
алгоритм декомпозиции, алгоритм разложения, блочный алгоритмАнгло-русский словарь по экономике и финансам > decomposition algorithm
-
7 decomposition algorithm
алгоритм декомпозиции, алгоритм разложения, алгоритм разбиения, алгоритм разбора
Англо-русский словарь по робототехнике > decomposition algorithm
-
8 decomposition algorithm
-
9 decomposition algorithm
The English-Russian dictionary on reliability and quality control > decomposition algorithm
-
10 LU decomposition algorithm
Макаров: алгоритм LU-разложения (в САПР)Универсальный англо-русский словарь > LU decomposition algorithm
-
11 LU decomposition algorithm
English-Russian electronics dictionary > LU decomposition algorithm
-
12 LU decomposition algorithm
The New English-Russian Dictionary of Radio-electronics > LU decomposition algorithm
-
13 algorithm
1) алгоритм2) правило; процедура; метод•- adaptive algorithm
- Agarval-Cooley algorithm
- aim algorithm
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- backoff algorithm
- back propagation of error algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm - CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm - greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm - iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-Moore algorithm
- Lee algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm - min-cut algorithm - nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- quantum search algorithm
- quick-union algorithm
- quick-union algorithm with path compression
- Q-R-algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm - routing algorithm
- Rprop algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm - self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm - shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithm -
14 algorithm
1) алгоритм2) правило; процедура; метод•- Agarval-Cooley algorithm
- aim algorithm
- algorithm of doubtful convergence
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- back propagation of error algorithm
- backoff algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm
- British Telecom Lempel-Ziv algorithm
- BTLZ algorithm
- CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm
- genetic algorithm
- graph search algorithm
- greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm
- international data encryption algorithm
- iterative algorithm
- iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-algorithm
- Lee-Moore algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm
- message authentication algorithm
- metaheuristic algorithm
- min-cut algorithm
- modified Gram-Schmidt algorithm
- Nelder-Mead simplex algorithm
- nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- Q-R-algorithm
- quantum search algorithm
- quick-union algorithm with path compression
- quick-union algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm
- Rivest-Shamir-Adleman algorithm
- robust algorithm
- routing algorithm
- RProp algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm
- secure hash algorithm
- selective-trace algorithm
- self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm
- sequential leader clustering algorithm
- serial algorithm
- shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithmThe New English-Russian Dictionary of Radio-electronics > algorithm
-
15 algorithm
4-D algorithm4-D descent advisor algorithmaiming algorithmBayesian algorithmBeam-Warming algorithmCFD algorithmCholesky algorithmcommand generation algorithmcomputational fluid dynamics algorithmcontrol algorithmdecomposition algorithmdesign algorithmdiagnosing algorithmdiagnosis algorithmdisplay algorithmengagement algorithmestimation algorithmEuler equation algorithmexplicit-implicit algorithmfeasible directions algorithmfeedback algorithmfilter algorithmfinite-volume algorithmflight management algorithmflight path algorithmflux-split algorithmFMS algorithmfrequency domain algorithmGauss-Newton algorithmgeometry generation algorithmgradient-based algorithmgrid algorithmguidance algorithmgunnery algorithmhidden surface algorithmimage-display algorithmLanczos algorithmleast-squares algorithmLevenberg-Marquardt algorithmlinear quadratic algorithmMacCormack algorithmmaneuver algorithmmaneuvering algorithmmarching algorithmmaximum likelihood estimate algorithmminimum variance algorithmmotion drive algorithmmotion-base drive algorithmmultigrid algorithmNavier-Stokes algorithmNewton-Raphson algorithmnonlinear programming algorithmoptimization algorithmplanning algorithmpole placement algorithmPotter algorithmQR algorithmrelaxation algorithmscheduling algorithmsearch algorithmshock fitting algorithmshock-capturing algorithmspeed profile algorithmspeed selection algorithmstability algorithmstate estimation algorithmsteepest descents algorithmsynthesis algorithmthrust algorithmtime-split algorithmtime-to-go algorithmtrim algorithmtwo-stage algorithm of splittingup-date algorithmupwind algorithmupwind-differenced algorithmvariable-gain algorithmweighted least squareszonal algorithm -
16 algorithm
-
17 decomposition
декомпозиция, разложение, разбиение, развязка, устранение взаимовлияния
– decomposition algorithm
– decomposition technique
-
18 modular decomposition
-
19 topological decomposition
-
20 modular decomposition
English-Russian big polytechnic dictionary > modular decomposition
- 1
- 2
См. также в других словарях:
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
LU decomposition — In linear algebra, LU decomposition (also called LU factorization) is a matrix decomposition which writes a matrix as the product of a lower triangular matrix and an upper triangular matrix. The product sometimes includes a permutation matrix as… … Wikipedia
Dantzig–Wolfe decomposition — is an algorithm for solving linear programming problems with special structure. It was originally developed by George Dantzig and Phil Wolfe and initially published in 1960[1]. Many texts on linear programming have sections dedicated to… … Wikipedia
Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… … Wikipedia
Balancing domain decomposition — In numerical analysis, the balancing domain decomposition method (BDD) is an iterative method to find the solution of a symmetric positive definite system of linear algebraic equations arising from the finite element method J. Mandel, Balancing… … Wikipedia
Crout matrix decomposition — In linear algebra, the Crout matrix decomposition is an LU decomposition which decomposes a matrix into a lower triangular matrix (L), an upper triangular matrix (U) and, although not always needed, a permutation matrix (P). The Crout matrix… … Wikipedia
Cylindrical algebraic decomposition — Given a set of polynomials in Rn and a set S in Rn the Cylindrical algebraic decomposition algorithm finds a decomposition of S in to a number of cells such that for each cell each polynomial has constant sign. See also Quantifier elimination… … Wikipedia
Singular value decomposition — Visualization of the SVD of a 2 dimensional, real shearing matrix M. First, we see the unit disc in blue together with the two canonical unit vectors. We then see the action of M, which distorts the disk to an ellipse. The SVD decomposes M into… … Wikipedia
Cholesky decomposition — In linear algebra, the Cholesky decomposition or Cholesky triangle is a decomposition of a Hermitian, positive definite matrix into the product of a lower triangular matrix and its conjugate transpose. It was discovered by André Louis Cholesky… … Wikipedia
QR algorithm — In numerical linear algebra, the QR algorithm is an eigenvalue algorithm; that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR transformation was developed in 1961 by John G.F. Francis (England) and by Vera N.… … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
